◀ Prev · Parts · Full · Next ▶

This mutation for larger values of k {\displaystyle k} , such as 10, is less well suited for tasks where the optimum lies on one of the value range boundaries. This can be remedied by significantly reducing k {\displaystyle k} when a gene value approaches its limits very closely.

For both mutation operators for real-valued numbers, the probability of an increase and decrease is independent of the current value and is 50% in each case. In addition, small changes are considerably more likely than large ones. For mixed-integer optimization problems, rounding is usually used.

Mutations of permutations are specially designed for genomes that are themselves permutations of a set. These are often used to solve combinatorial tasks.cite-ref-0-8-3[8]cite-ref-1-18-0[18]cite-ref-2-19-0[19] In the two mutations presented, parts of the genome are rotated or inverted.

The presentation of the procedurecite-ref-2-19-1[19] is illustrated by an example on the right:

The presentation of the procedurecite-ref-1-18-1[18] is illustrated by an example on the right:

◀ Prev · Parts · Full · Next ▶